Geometric Programming for Communication Systems Geometric Programming for Communication Systems

Geometric Programming (GP) is a class of nonlinear optimization withmany useful theoretical and computational properties. Over the last fewyears, GP has been used to solve a variety of problems in the analysisand design of communication systems in several ‘layers’ in the commu-nication network architecture, including information theory problems,signal processing algorithms, basic queuing system optimization, manynetwork resource allocation problems such as power control and conges-tion control, and cross-layer design. We also start to understand why,in addition to how, GP can be applied to a surprisingly wide range ofproblems in communication systems. These applications have in turnspurred new research activities on GP, especially generalizations of GPformulations and development of distributed algorithms to solve GP ina network. This text provides both an in-depth tutorial on the theory,algorithms, and modeling methods of GP, and a comprehensive surveyon the applications of GP to the study of communication systems.